Deciding Definability by Deterministic Regular Expressions
نویسندگان
چکیده
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with counters.
منابع مشابه
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable
We show that weakly deterministic regular expressions with counters (WDREs) —as they are used in XML Schema— are at most exponentially larger than equivalent DFAs. As a consequence, the problem, whether a given DFA is equivalent to any WDRE, is decidable in EXPSPACE.
متن کاملChecking Determinism of Regular Expressions with Counting
We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...
متن کاملTesting the Equivalence of Regular Languages 1
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski’s notion of derivative, Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic fini...
متن کاملDeciding determinism of unary languages
In this paper, we investigate the complexity of deciding determinism of unary languages. First, we give a method to derive a set of arithmetic progressions from a regular expression E over a unary alphabet, and establish relations between numbers represented by these arithmetic progressions and words in L(E). Next, we define a problem relating to arithmetic progressions and investigate the comp...
متن کاملTesting the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic finite automata that avoids minimisation. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 88 شماره
صفحات -
تاریخ انتشار 2013